Graph Parameters and Ramsey Theory
نویسنده
چکیده
Ramsey’s Theorem tells us that there are exactly two minimal hereditary classes containing graphs with arbitrarily many vertices: the class of complete graphs and the class of edgeless graphs. In other words, Ramsey’s Theorem characterizes the graph vertex number in terms of minimal hereditary classes where this parameter is unbounded. In the present paper, we show that a similar Ramsey-type characterization is possible for a number of other graph parameters, such as vertex cover number, matching number, neighbourhood diversity, VC-dimension.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملConditions on Ramsey Nonequivalence
Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramsey equivalent if they have the same set of Ramsey graphs. Fox et al. [J. Combin. Theory Ser. B 109 (2014), 120–133] asked whether there are two nonisomorphic connected graphs that are Ramsey equivalent. They proved tha...
متن کاملGraph Powers
The investigation of the asymptotic behaviour of various parameters of powers of a fixed graph leads to many fascinating problems, some of which are motivated by questions in information theory, communication complexity, geometry and Ramsey theory. In this survey we discuss these problems and describe the techniques used in their study which combine combinatorial, geometric, probabilistic and l...
متن کاملOn the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملObtaining Bounds for Ramsey Numbers
There are two equivalent problem statements for the Ramsey number n = R(k; l). n is the minimum number of vertices in the graph such that it contains a complete graph of k vertices, or an independent set of l vertices. n is the minimum number of vertices such that if all the edges of the complete graph on n vertices, denoted by K n is colored with two colors, fRed, Blueg, then there exists a Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.07727 شماره
صفحات -
تاریخ انتشار 2016